Real solution isolation with multiplicity of zero-dimensional triangular systems
نویسندگان
چکیده
منابع مشابه
Complete numerical isolation of real roots in zero-dimensional triangular systems
We present a complete numerical algorithm of isolating all the real zeros of a zero-dimensional triangular polynomial system Fn ⊆ Z[x1, . . . , xn]. Our system Fn is general, with no further assumptions. In particular, our algorithm successfully treat multiple zeros directly in such systems. A key idea is to introduce evaluation bounds and sleeve bounds. We also present a much more efficient al...
متن کاملZero Decomposition with Multiplicity of Zero-Dimensional Polynomial Systems
We present a zero decomposition theorem and an algorithm based on Wu’s method, which computes a zero decomposition with multiplicity for a given zerodimensional polynomial system. If the system satisfies some condition, the zero decomposition is of triangular form.
متن کاملComplete Numerical Isolation of Real Zeros in General Triangular Systems∗
We consider the computational problem of isolating all the real zeros of a zero-dimensional triangular polynomial system Fn ⊆ Z[x1, . . . , xn]. We present a complete numerical algorithm for this problem. Our system Fn is general, with no further assumptions. In particular, our algorithm is the first to successfully treat multiple zeros in such systems. A key idea is to introduce evaluation and...
متن کاملA Generic Position Based Method for Real Root Isolation of Zero-Dimensional Polynomial Systems
We improve the local generic position method for isolating the real roots of a zero-dimensional bivariate polynomial system with two polynomials and extend the method to general zerodimensional polynomial systems. The method mainly involves resultant computation and real root isolation of univariate polynomial equations. The roots of the system have a linear univariate representation. The compl...
متن کاملOn the complexity of computing with zero-dimensional triangular sets
We generalize Kedlaya and Umans’ modular composition algorithm to the multivariate case. As a main application, we give fast algorithms for many operations involving triangular sets (over a finite field), such as modular multiplication, inversion, or change of order. For the first time, we are able to exhibit running times for these operations that are almost linear, without any overhead expone...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2011
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-010-4154-y